A Goal-Directed Bayesian Framework for Categorization
نویسندگان
چکیده
منابع مشابه
A Goal-Directed Bayesian Framework for Categorization
Categorization is a fundamental ability for efficient behavioral control. It allows organisms to remember the correct responses to categorical cues and not for every stimulus encountered (hence eluding computational cost or complexity), and to generalize appropriate responses to novel stimuli dependant on category assignment. Assuming the brain performs Bayesian inference, based on a generative...
متن کاملA Model-Based Goal-Directed Bayesian Framework for Imitation Learning in Humans and Machines
Imitation offers a powerful mechanism for knowledge acquisition, particularly for intelligent agents (like infants) that lack the ability to transfer knowledge using language. Several algorithms and models have recently been proposed for imitation learning in humans and robots. However, few proposals offer a framework for imitation learning in noisy stochastic environments where the imitator mu...
متن کاملA Framework for Goal-Directed Query Evaluation with Negation
This paper contains a proposal how goal-directed query evaluation for the well-founded semantics WFS (and other negation semantics) can be done based on elementary program transformations. It also gives a new look at the author’s SLDMagic method, which has several advantages over the standard magic set method (e.g., for tail recursions).
متن کاملEdge-Directed Interpolation in a Bayesian Framework
In this paper we present a novel framework for Edge-Directed Interpolation (EDI) of still images. The problem is treated as finding maximum a posteriori estimates of each interpolated pixel type and intensity value. The pixel type may be one of the pre-defined edge directions or "non-edge". Instead of the separate steps of edge orientation detection and intensity interpolation, maximizing the j...
متن کاملProbability Bounds for Goal Directed Queries in Bayesian Networks
We derive bounds on the belief in a goal node given a set of acquired input nodes. The bounds apply to decomposable networks, a class of Bayesian Networks encompassing causal trees, causal polytrees, and some nonsingly connected networks. The difficulty of computing the bounds depends on the characteristics of the decomposable network. For directly connected networks with binary goal nodes, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Psychology
سال: 2017
ISSN: 1664-1078
DOI: 10.3389/fpsyg.2017.00408